On Partial Order Characterizations of Information Structures
نویسندگان
چکیده
منابع مشابه
On Partial Order Characterizations of Information Structures
The degree of concurrency possible in an informationally decentralized nonsequential system is determined by the precedence constraints imposed by the system's information structure on its controlled and uncontrolled inputs. One approach to characterizing these constraints is to attempt to associate each realization of the system's inputs with the strongest partial ordering of the sys-tem's dec...
متن کاملPartial cubes: structures, characterizations, and constructions
Partial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means of semicubes, and Djoković’s and Winkler’s relations play an important role in the theory of partial cubes. These structures are employed in the paper to characterize bipartite graphs and partial cubes of arbitrary dimension. New characterizations are established and new proofs of some known results are ...
متن کاملPartial Order Knowledge Structures for CAT Applications
Bayesian and graph models of student knowledge assessment have made significant progress in the last decadeand are challenging the more traditional IRT approach for CAT applications. We review some of the most prominent frameworks in Bayesian knowledge assessment and how they compare to IRT and introduce one such framework in the family of Bayesian models, the POKS (Partial Order Knowlege Struc...
متن کاملPartial Characterizations of Circle Graphs
A circle graph is the intersection graph of a family of chords on a circle. There is no known characterization of circle graphs by forbidden induced subgraphs that do not involve the notions of local equivalence or pivoting operations. We characterize circle graphs by a list of minimal forbidden induced subgraphs when the graph belongs to one of the following classes: linear domino graphs, P4-t...
متن کاملCoinductive characterizations of applicative structures
We discuss new ways of characterizing, as maximal xed points of monotone operators, observational congruences on-terms and, more in general, equivalences on applicative structures. These characterizations naturally induce new forms of coinduction principles, for reasoning on program equivalences, which are not based on Abramsky's applicative bisimulation. We discuss in particular, what we call,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Control, Signals, and Systems
سال: 2000
ISSN: 0932-4194
DOI: 10.1007/pl00009870